255A - Greg's Workout - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

input()
a=[*map(int,input().split())]
print(['chest','biceps','back'][max(0,1,2,key=lambda i: sum(a[i::3]))])

C++ Code:

#include <iostream>

using namespace std;

int main()
{
int n,a[3]={0,0,0},b;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>b;
a[i%3]+=b;
}
if(a[0]>a[1]&&a[0]>a[2])
cout<<"chest"<<endl;
if(a[1]>a[0]&&a[1]>a[2])
cout<<"biceps"<<endl;
if(a[2]>a[1]&&a[2]>a[0])
cout<<"back"<<endl;
    return 0;
}


Comments

Submit
0 Comments
More Questions

41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)